Projected Wirtinger Gradient Descent for Digital Waves Reconstruction
نویسندگان
چکیده
منابع مشابه
Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing
This paper considers reconstructing a spectrally sparse signal from a small number of randomly observed time-domain samples. The signal of interest is a linear combination of complex sinusoids at R distinct frequencies. The frequencies can assume any continuous values in the normalized frequency domain [0, 1). After converting the spectrally sparse signal recovery into a low rank structured mat...
متن کاملCNN-Based Projected Gradient Descent for Consistent Image Reconstruction
We present a new method for image reconstruction which replaces the projector in a projected gradient descent (PGD) with a convolutional neural network (CNN). CNNs trained as high-dimensional (image-to-image) regressors have recently been used to efficiently solve inverse problems in imaging. However, these approaches lack a feedback mechanism to enforce that the reconstructed image is consiste...
متن کاملSpectral Compressed Sensing via Projected Gradient Descent
Let x ∈ C be a spectrally sparse signal consisting of r complex sinusoids with or without damping. We consider the spectral compressed sensing problem, which is about reconstructing x from its partial revealed entries. By utilizing the low rank structure of the Hankel matrix corresponding to x, we develop a computationally efficient algorithm for this problem. The algorithm starts from an initi...
متن کاملMaterial for “ Spectral Compressed Sensing via Projected Gradient Descent ”
We extend PGD and its recovery guarantee [1] from one-dimensional spectrally sparse signal recovery to the multi-dimensional case. Assume the underlying multi-dimensional spectrally sparse signal is of model order r and total dimension N . We show that O(r log(N)) measurements are sufficient for PGD to achieve successful recovery with high probability provided the underlying signal satisfies so...
متن کاملNon-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression
In this paper, we consider the problem of learning high-dimensional tensor regression problems with low-rank structure. One of the core challenges associated with learning high-dimensional models is computation since the underlying optimization problems are often non-convex. While convex relaxations could lead to polynomialtime algorithms they are often slow in practice. On the other hand, limi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Traitement du Signal
سال: 2020
ISSN: 0765-0019,1958-5608
DOI: 10.18280/ts.370605